Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph
نویسندگان
چکیده
An i-triangulated graph is a graph in which every odd cycle has two non-crossing chords; i-triangulated graphs form a subfamily of perfect graphs. A slightly more general family of perfect graphs are clique-separable graphs. A graph is clique-separable precisely if every induced subgraph either has a clique cutset, or is a complete multipartite graph or a clique joined to an arbitrary bipartite graph. We exhibit a polynomial time algorithm for finding the maximum-weight induced k-partite subgraph of an i-triangulated graph, and show that the same problem is NP -complete for clique-separable graphs, even in the unweighted case when k = 2.
منابع مشابه
Finding the maximum-weight induced k-partite subgraph of an i-triangulated graph
An i-triangulated graph is a graph in which every odd cycle has two non-crossing chords; i-triangulated graphs form a subfamily of perfect graphs. A slightly more general family of perfect graphs are clique-separable graphs. A graph is clique-separable precisely if every induced subgraph either has a clique cutset, or is a complete multipartite graph or a clique joined to an arbitrary bipartite...
متن کاملStudy on the new graph constructed by a commutative ring
Let R be a commutative ring and G(R) be a graph with vertices as proper andnon-trivial ideals of R. Two distinct vertices I and J are said to be adjacentif and only if I + J = R. In this paper we study a graph constructed froma subgraph G(R)Δ(R) of G(R) which consists of all ideals I of R such thatI Δ J(R), where J(R) denotes the Jacobson radical of R. In this paper westudy about the relation b...
متن کاملJudicious partitions of graphs
The problem of finding good lower bounds on the size of the largest bipartite subgraph of a given graph has received a fair amount of attention. In particular, improving a result of Erdős ([10]; see also [11] for related problems), Edwards [9] proved the essentially best possible assertion that every graph with n vertices and m edges has a bipartite subgraph with at least m/2 + (n − 1)/4 edges....
متن کاملOptimizing slightly triangulated graphs
Graphs is called slightly if it contaiw; no chordless cyck or more vertices and induced subgrapb has a vertex whose nellgnLoc1urnooCl contains no induced path on four verticf~S. These graphs triangulated graphs and appear naturally in the study of thf~ inhcrsection graphs of the maximal rectangles of trii::.tngulated graphs are perfect (in the sense of Berge). In this paper WI? present algorith...
متن کاملThe spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 158 شماره
صفحات -
تاریخ انتشار 2010